Predicate transformers for reasoning about concurrent computation
نویسندگان
چکیده
منابع مشابه
Predicate Transformers for Convex Powerdomains
We investigate laws for predicate transformers for the combination of nondeterministic choice and (extended) probabilistic choice, where predicates are taken to be functions to the extended nonnegative reals, or to closed intervals of such reals. These predicate transformers correspond to state transformers, which are functions to convex powerdomains, the appropriate powerdomains for the combin...
متن کاملHealthiness Conditions for Predicate Transformers
The behavior of a program can be modeled by describing how it transforms input states to output states, the state transformer semantics. Alternatively, for verification purposes one is interested in a ’predicate transformer semantics’ which, for every condition on the output, yields the weakest precondition on the input that guarantees the desired property for the output. In the presence of com...
متن کاملReasoning about Concurrent Objects
Embedded speciications in object-oriented languages such as Eiiel are based on a rigorous approach towards validation, compatibility and reusability of sequential programs. Such speciications are not limited to functional and interface aspects but extend to complexity and, more generally, quantitative aspects in a straightforward way. However concurrent object-oriented languages are still in th...
متن کاملReasoning about Concurrent Indexes
Index data structures such as B+ trees and hash tables are used widely as the core of databases andfile systems. In a world where concurrent systems are common as servers and largely increasing aspersonal computers, we need a way to make sure concurrent implementations do not contain bugs.We use the fact that multiple implementations share a common high-level specification and use<l...
متن کاملUnderapproximating Predicate Transformers
We study the underapproximation of the predicate transformers used to give semantics to the modalities in dynamic and temporal logic. Because predicate transformers operate on state sets, we define appropriate powerdomains for sound approximation. We study four such domains — two are based on “set inclusion” approximation, and two are based on “quantification” approximation — and we apply the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1995
ISSN: 0167-6423
DOI: 10.1016/0167-6423(94)00033-b